package java_test.data_structure;

public class MyStack {
    private int maxSize;
    private long[] stackArray;
    private int top;

    public MyStack(int s) {
        maxSize = s;
        stackArray = new long[maxSize];
        top = -1;
    }

    public void push(long j) {
        stackArray[++top] = j;
    }

    public long pop() {
        return stackArray[top--];
    }

    public long peek() {
        return stackArray[top];
    }

    public boolean isEmpty() {
        return (top == -1);
    }

    public static void main(String[] args) throws Exception {
        try {
            MyStack theStack = new MyStack(10);
            theStack.push(10);
            theStack.push(20);
            theStack.push(30);
            theStack.push(40);
            theStack.push(50);
            while (!theStack.isEmpty()) {
                long value = theStack.pop();
                System.out.println(value);
            }
            System.out.println("");
        } catch (Exception e) {
            System.out.println(e + "数组越界");
        }

    }
}
